On the connectivity of cages with girth five, six and eight
نویسندگان
چکیده
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices. Recently, some authors have addressed the problem of studying their connectivity parameters. In this direction, it was conjectured by Fu, Huang and Rodger that every (δ, g)-cage is maximally connected, i.e., it is δ-connected, and they proved this statement for δ = 3. We provide a new contribution to the proof of that conjecture, by showing that every (δ, g)-cage, with g = 6, 8, is maximally connected, and by assuring either maximal connectivity or superconnectivity for some (δ, 5)-cages.
منابع مشابه
On Some Properties of Cages
A (k; g)-cage is a graph with the minimum order among all k-regular graphs with girth g. As a special family of graphs, (k; g)-cages have a number of interesting properties. In this paper, we investigate various properties of cages, e.g., connectivity, the density of shortest cycles, bricks and braces.
متن کاملNew improvements on connectivity of cages
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In this paper, we show that all (δ, g)-cages with odd girth g ≥ 9 are r-connected, where (r − 1) ≤ δ + √ δ − 2 < r and all (δ, g)-cages with even girth g ≥ 10 are r-connected, where r is the largest integer satisfying r(r−1) 2 4 + 1 + 2r(r − 1) ≤ δ. Those results support a conjecture of Fu, Huang and...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملOn superconnectivity of (4, g)-cages with even girth
A (k, g)-cage is a k-regular graph with girth g that has the fewest number of vertices. It has been conjectured [Fu, Huang, and Rodger, Connectivity of cages, J. Graph Theory 24 (1997), 187-191] that all (k, g)-cages are k-connected for k ≥ 3. A connected graph G is said to be superconnected if every minimum cut-set S is the neighborhood of a vertex of minimum degree. Moreover, if G − S has pre...
متن کاملA Note on the Edge-Connectivity of Cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the smallest possible number of vertices. In this paper we prove that (k; g)cages are k-edge-connected if k ≥ 3 and g is odd.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007